Minimal bad sequences are necessary for a uniform Kruskal theorem

Kruskal's theorem on trees is a classical result of combinatorics with important applications in computer science. The minimal bad sequence argument Nash-Williams yields proof that very elegant but not as elementary possible, by previous results from mathematical logic. In the present paper, we formulate uniform Kruskal theorem, which extends original to general recursive data types. Our main shows does yield most this theorem. So case, coincides one. more precise and technical terms, work framework reverse mathematics, where show equivalent ?11-comprehension, over RCA0 extended chain-antichain principle. As by-product our investigation, obtain proofs several Kruskal-type independence results.